A sharp lower-tail bound for Gaussian maxima with application to bootstrap methods in high dimensions
نویسندگان
چکیده
Although there is an extensive literature on the maxima of Gaussian processes, are relatively few non-asymptotic bounds their lower-tail probabilities. The aim this paper to develop such a bound, while also allowing for many types dependence. Let (ξ1,…,ξN) be centered vector with standardized entries, whose correlation matrix R satisfies maxi≠jRij≤ρ0 some constant ρ0∈(0,1). Then, any ϵ0∈(0,1−ρ0), we establish upper bound probability P(max1≤j≤Nξj≤ϵ0 2log(N)) in terms (ρ0,ϵ0,N). sharp, sense that it attained up constant, independent N. Next, apply result context high-dimensional statistics, where simplify and weaken conditions have recently been used near-parametric rates bootstrap approximation. Lastly, interesting aspect application makes use recent refinements Bourgain Tzafriri’s “restricted invertibility principle”.
منابع مشابه
A Sharp Lower Bound for Mixed-membership
The goal is to estimate {πi, 1 ≤ i ≤ n} (i.e., membership estimation). We model the network with the degree-corrected mixed membership (DCMM) model [8]. Since for many natural networks, the degrees have an approximate power-law tail, we allow severe degree heterogeneity in our model. For any membership estimation {π̂i, 1 ≤ i ≤ n}, since each πi is a probability mass function, it is natural to me...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولA Sharp Tail Bound for the Expander Random Sampler
Consider an expander graph in which a μ fraction of the vertices are marked. A random walk starts at a uniform vertex and at each step continues to a random neighbor. Gillman showed in 1998 that the number of marked vertices seen in a random walk of length n is concentrated around its expectation, Φ := μn, independent of the size of the graph. Here we provide a new and sharp tail bound, improvi...
متن کاملSharp failure rates for the bootstrap particle filter in high dimensions
We prove that the maximum of the sample importance weights in a high-dimensional Gaussian particle filter converges to unity unless the ensemble size grows exponentially in the system dimension. Our work is motivated by and parallels the derivations of Bengtsson, Bickel and Li (2007); however, we weaken their assumptions on the eigenvalues of the covariance matrix of the prior distribution and ...
متن کاملA Lower Bound for the Wehrl Entropy of Quantum Spin with Sharp High-spin Asymptotics
We derive a lower bound for the Wehrl entropy of a single quantum spin. The high-spin asymptotics of this bound coincides with Lieb’s conjecture up to first order in the inverse spin quantum number. The result presented here may be seen as complementary to the verification of the conjecture in cases of lowest spin by Schupp [Commun. Math. Phys. 207 (1999), 481]. In addition, we extend the valid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2022
ISSN: ['1935-7524']
DOI: https://doi.org/10.1214/21-ejs1961